A Note on Large Cycles in Graphs Around Conjectures of Bondy and Jung

نویسندگان

چکیده

New sufficient conditions are derived for generalized cycles (including Hamilton and dominating as special cases) in an arbitrary k-connected (k = 1, 2, ...) graph, which prove the truth of Bondy’s (1980) famous conjecture some variants significantly improving result expected by given hypothesis. Similarly, new lower bounds circumference (the length a longest cycle) established reverse hypothesis proposed Jung (2001) combined inspiring improved versions original conjectures Bondy Jung.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On cycles in intersection graphs of rings

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

متن کامل

Note on Conjectures of Bondage Numbers of Planar Graphs

The bondage number of a graph G is the cardinality of a smallest set of edges whose removal results in a graph with domination number larger than that of G. The bondage number measures to some extent the robustness of a network with respect to link failure. This note mainly considers some conjectures on the bondage number of a planar graph, and shows limitations of known methods and presents so...

متن کامل

A note on vague graphs

In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.

متن کامل

A Note on Tensor Product of Graphs

Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical problems of computer science

سال: 2023

ISSN: ['2579-2784']

DOI: https://doi.org/10.51408/1963-0097